Auto-complétion de requêtes par une base générique de règles d'association triadiques

The exploitation of social networks and collaborative systems as part of a process of information retrieval is a phenomenon that is gradually integrated into the practices of Internet research. These systems, emerging from the era of Web 2.0, allow participants to collaborate using keywords, tags, creating lightweight structures represented as tripartite hypergraphs of users, tags and resources, aka folksonomies. In this paper, we exploit these triples (resources, users, tags) to introduce a new definition of a generic basis of triadic association rules, called BGRT . We show that the use of generic non-redundant rules for auto-completion feature allows applications to highlight the relevance of folksonomies and their real interest in the case of information retrieval. The first results obtained on a real folksonomy, collected from the social network DELICIOUS, are promising and offer many opportunities. MOTS-CLÉS : folksonomies, auto-complétion de requêtes, règles d’association triadiques